All Questions
2 questions
1vote
0answers
372views
Codewars: Path Finder
Task You are at position [0, 0] in maze NxN and you can only move in one of the four cardinal directions (i.e. North, East, South, West). Return true if you can reach position [N-1, N-1] or false ...
2votes
1answer
842views
Ternary tree preoder traversal (recursive implementation)
Problem statement: Print out to console the ternary tree preorder traversal. Suppose that the tree can have at most 3 children, left, middle and right. Preorder traversal is to visit the middle ...
- 2,416
